A Theory for Composing Distributed Components, Based on Mutual Exclusion
نویسندگان
چکیده
Compositionality provides the foundation of software modularity, reusability and separate verification of software components. One of the known difficulties, when separately verifying components, is producing compositional proofs for progress properties of distributed systems. This paper presents a new composition theory based on reasoning about temporary interference. The approach is axiomatic, enabling us to capture aspects relevant for composition in a direct and clean way, and resulting in a theory which in our opinion is elegant and easy to understand, in particular when dealing with progressproperties. The theory only deals with components that synchronize by mutual exclusion –though it will be discussed how it could be extended.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Study on Distributed k-Mutual Exclusion Algorithms
The mutual exclusion problem is a problem of arbitrating access conflicts for resources. The problem has been considered as a fundamental problem in computer science and extensively studied from the first minute operating systems started providing multi-tasking or multi-programming feature. Recently, a large number of computers are connected to a computer network. Such a system is called a dist...
متن کاملA Framework for Fault-Tolerant Distributed Mutual Exclusion and Replica Control Using Grid Structures
This paper presents a framework for fault-tolerant distributed mutual exclusion and replica control algorithms utilizing overlapping grid quorums, which are sets constructed with the aid of grid structures. There are two components of the framework: the first one concerns generic representation of grid quorums, and the second one, generic verification of the overlapping properties of grid quoru...
متن کاملTwo New Quorum Based Algorithms for Distributed Mutual Exclusion
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of quorums is approximately p 2 p N where N is the number of sites in a network, as compared to 2 p N of the original method. The method is simple and geometrically evident. The second one is based on the idea of di erence set...
متن کاملA Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion
Quorum-based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well-known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...
متن کامل